Injectively homogeneous rings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A class of Artinian local rings of homogeneous type

‎Let $I$ be an ideal in a regular local ring $(R,n)$‎, ‎we will find‎ ‎bounds on the first and the last Betti numbers of‎ ‎$(A,m)=(R/I,n/I)$‎. ‎if $A$ is an Artinian ring of the embedding‎ ‎codimension $h$‎, ‎$I$ has the initial degree $t$ and $mu(m^t)=1$‎, ‎we call $A$ a {it $t-$extended stretched local ring}‎. ‎This class of‎ ‎local rings is a natural generalization of the class of stretched ...

متن کامل

On Homogeneous Nilpotent Groups and Rings

We give a new framework for the construction of homogeneous nilpotent groups and rings which goes a long way toward unifying the two cases, and enables us to extend previous constructions, producing a variety of new examples. In particular we find ingredients for the manufacture of 2No homogeneous nilpotent groups "in nature".

متن کامل

How to Morph Tilings Injectively

We describe a method based on convex combinations for morphing corresponding pairs of tilings in IR. It is shown that the method always yields a valid morph when the boundary polygons are identical, unlike the standard linear morph.

متن کامل

a class of artinian local rings of homogeneous type

‎let $i$ be an ideal in a regular local ring $(r,n)$‎, ‎we will find‎ ‎bounds on the first and the last betti numbers of‎ ‎$(a,m)=(r/i,n/i)$‎. ‎if $a$ is an artinian ring of the embedding‎ ‎codimension $h$‎, ‎$i$ has the initial degree $t$ and $mu(m^t)=1$‎, ‎we call $a$ a {it $t-$extended stretched local ring}‎. ‎this class of‎ ‎local rings is a natural generalization of the class of stretched ...

متن کامل

Data Redistribution Algorithms for Homogeneous and Heterogeneous Processor Rings

We consider the problem of redistributing data on homogeneous and heterogeneous processor rings. The problem arises in several applications, each time after a load-balancing mechanism is invoked (but we do not discuss the load-balancing mechanism itself). We provide algorithms that aim at optimizing the data redistribution, both for unidirectional and bi-directional rings. One major contributio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1988

ISSN: 0022-4049

DOI: 10.1016/0022-4049(88)90078-3